
<html>
<head>
	<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
	<link rel=stylesheet href='include/hoj.css' type='text/css'>
</head>
<body>
<center>
<div style="width:90%; text-align:left">
<img src="image/logo.png"/>
</div>
<table width=96%> 
	<tr align="center" class='hd' valign="top">
				<th><a href="faqs.php">F.A.Qs</a></th>
		<th><a href="./bbs.php">Web Board</a></th>
		<th><a href="./">Home</a></th>
		<th><a href="./problemset.html">ProblemSet</a></th>
		<th><a href="./status.php">Status</a></th>
		<th><a href="./ranklist.php">Ranklist</a></th>
		<th><a href="./contest.php">Contest</a></th>
		<th><a href=loginpage.php>Login</a></th><th><a href=registerpage.php>Register</a></th>	</tr>
</table>
</center>
<center>
<div class="notice">
	<div>
		<B>Notice:</B>鉴于种种原因，本OJ自下周星期一（3月5号）开始不再全面开放，请各位做好善后事宜，谢谢合作。	</div>
</div>
</center>
</div>
<title>Problem 1652. -- [Usaco2006 Feb]Treats for the Cows -- 衡阳八中OJ离线版-2012-02-29</title><center><h2>1652: [Usaco2006 Feb]Treats for the Cows</h2><span class=green>Time Limit: </span>5 Sec&nbsp;&nbsp;<span class=green>Memory Limit: </span>64 MB<br><span class=green>Submit: </span>96&nbsp;&nbsp;<span class=green>Solved: </span>77<br>[<a href='submitpage.php?id=1652'>Submit</a>][<a href='problemstatus.php?id=1652'>Status</a>][<a href='bbs.php?id=1652'>Discuss</a>]</center><h2>Description</h2><div class=content>FJ has purchased N (1 <= N <= 2000) yummy treats for the cows who
get money for giving vast amounts of milk. FJ sells one treat per
day and wants to maximize the money he receives over a given period
time.

The treats are interesting for many reasons:
  * The treats are numbered 1..N and stored sequentially in single
    file in a long box that is open at both ends. On any day, FJ
    can retrieve one treat from either end of his stash of treats.
  * Like fine wines and delicious cheeses, the treats improve with
    age and command greater prices.
  * The treats are not uniform: some are better and have higher
    intrinsic value. Treat i has value v(i) (1 <= v(i) <= 1000).
  * Cows pay more for treats that have aged longer: a cow will
    pay v(i)*a for a treat of age a.

Given the values v(i) of each of the treats lined up in order of
the index i in their box, what is the greatest value FJ can receive
for them if he orders their sale optimally?

The first treat is sold on day 1 and has age a=1. Each subsequent
day increases the age by 1.

</div><h2>Input</h2><div class=content>* Line 1: A single integer, N

* Lines 2..N+1: Line i+1 contains the value of treat v(i)

</div><h2>Output</h2><div class=content>
* Line 1: The maximum revenue FJ can achieve by selling the treats

</div><h2>Sample Input</h2>
			<div class=content><span class=sampledata><br />
5<br />
1<br />
3<br />
1<br />
5<br />
2<br />
<br />
Five treats. On the first day FJ can sell either treat #1 (value 1) or<br />
treat #5 (value 2).<br />
<br />
</span></div><h2>Sample Output</h2>
			<div class=content><span class=sampledata>43<br />
<br />
OUTPUT DETAILS:<br />
<br />
FJ sells the treats (values 1, 3, 1, 5, 2) in the following order<br />
of indices: 1, 5, 2, 3, 4, making 1x1 + 2x2 + 3x3 + 4x1 + 5x5 = 43.<br />
</span></div><h2>HINT</h2>
			<div class=content><p></p></div><h2>Source</h2>
			<div class=content><p><a href='problemset.html?search=Silver'>Silver</a></p></div><center>[<a href='submitpage.php?id=1652'>Submit</a>][<a href='problemstatus.php?id=1652'>Status</a>][<a href='bbs.php?id=1652'>Discuss</a>]</center>﻿<br>

<a href="./"><span class=red>HOME</span></a>
<a href="javascript:history.go(-1)"><span class=red>Back</span></a>

<hr>
<center>
	<div class="footer">
			<a href=setlang.php?lang=ko>한국어</a>&nbsp;
		<a href=setlang.php?lang=cn>中文</a>&nbsp;
		<a href=setlang.php?lang=fa>فارسی</a>&nbsp;
		<a href=setlang.php?lang=en>English</a>&nbsp;
		<a href=setlang.php?lang=th>ไทย</a>
	<br>		<div>版权所有 &copy;2008-2012 WaterPark Organization. | <script src="http://s21.cnzz.com/stat.php?id=2982771&web_id=2982771" language="JavaScript"></script>
</div>
		<div>Based on opensource project <a href="http://hustoj.googlecode.com">hustoj</a>.</div>
	</div>
</center>
</body>
</html>
